Two-step hierarchical assignments on molecular graphs
نویسندگان
چکیده
منابع مشابه
On two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملA Characterization of Graphs with Interval Two-Step Graphs
Dedicated by the other authors to Professor John Maybee on the occasion of his 65th birthday. Abstract. One of the intriguing open problems on competition graphs is determining what digraphs have interval competition graphs. This problem originated in the work of Cohen 5, 6] on food webs. In this paper we consider this problem for the class of loopless symmetric digraphs. The competition graph ...
متن کاملTwo-step excitation of molecular hydrogen
2014 A stepwise excitation of H2 is performed. Electron impact populates the metastable c 303A0u state then an optical resonance allows the excitation of 303A3g, 303A0g or 30394g states. We observed the selectivity of the electron impact excitation. The laser light used for the optical resonance was linearly polarized, the alignment produced allowed the observation of the Hanle effect on the 3 ...
متن کاملPareto-optimal assignments by hierarchical exchange
Papai’s 2000 hierarchical exchange mechanisms for house allocation problems determine matchings as the outcome of multiple rounds of trading cycles. Any hierarchical exchange mechanism can be defined through a structure of ownership, which determines the ownership of houses after any round of trading cycles. Given a permutation of agents, a “permuted” hierarchical exchange mechanism can be cons...
متن کاملOn Minimum-Cost Assignments in Unbalanced Bipartite Graphs
Consider a bipartite graph G = (X; Y ;E) with real-valued weights on its edges, and suppose that G is balanced, with |X| = |Y |. The assignment problem asks for a perfect matching in G of minimum total weight. Assignment problems can be solved by linear programming, but fast algorithms have been developed that exploit their special structure. The famous Hungarian Method runs in time O(mn+n 2 lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemistry Central Journal
سال: 2009
ISSN: 1752-153X
DOI: 10.1186/1752-153x-3-s1-p13